Reliability Evaluation of Stochastic-Flow Network under Quickest Path and System Capacity Constraints
نویسنده
چکیده
This paper proposes an algorithm to evaluate the probability that d units of data can be sent from the source node to the sink node through a valid group of paths on a network. The conditions of transmission are such that the transmission time of each path belonging to this valid group of paths does not exceed the specified upper bound T, and that the maximal capacity of that path is not less than the specified lower bound Cs (the required system capacity). Such a probability, which is called the system reliability, is denoted by R(d,Cs,T). Based on minimal paths, the algorithm generates all the lower boundary points for (d,Cs,T), and the system reliability can then be calculated in terms of all the lower boundary points for (d,Cs,T) by applying the inclusion-exclusion rule.
منابع مشابه
Reliability Evaluation of Multi-source Multi- Sink Stochastic-flow Networks under Quickest Path and System Capacity Constraints
A multi-source multi-sink stochastic-flow network consists of a set of nodes, including sources nodes si that supply resources and sink nodes tj where demands are realized, and a set of directed arcs that carry resource flows. This paper presents an algorithm to determine the probability, called system reliability ( T C d ij wj R ), that for each source–sink pair (si, tj), dwj (the demand for r...
متن کاملThe Stochastic Quickest Path Problem via Minimal Paths
The quickest path problem, a version of the shortest path problem, is to find a single quickest path which sends a given amount of data from the source to the sink with minimum transmission time. More specifically, the capacity of each arc in the network is assumed to be deterministic. However, in many real-life networks such as computer systems, telecommunication systems, etc., the capacity of...
متن کاملExtend the quickest path problem to the system reliability evaluation for a stochastic-flow network
From the point of view of quality management, it is an important issue to reduce the transmission time in the network. The quickest path problem is to 6nd the path in the network to send a given amount of data from the source to the sink such that the transmission time is minimized. Traditionally, this problem assumed that the capacity of each arc in the network is deterministic. However, the c...
متن کاملSolving flow allocation problems and optimizing system reliability of multisource multisink stochastic flow network
Flow allocation problem is one of the important steps in reliability evaluation or optimization of a stochastic flow network. In a single source single sink networks it is easy to determine the flow on each path by using one of best known methods. While, in the case of multisource multisink flow network the file allocation problem becomes more complicated and few studies have dealt with it. Thi...
متن کاملReliability Evaluation of Stochastic-flow Network through Two Minimal Intersecting Paths under Budget and Time Constraints
A stochastic flow network (SFN) is more suitable than a general network to describe some real systems as it is composed of multistate links as well as multistate nodes. As the nodes and the links have different capacities at different time, the minimum transmission time through a stochastic flow network is not fixed. In order to shorten the transmission time, in this paper the data are allowed ...
متن کامل